منابع مشابه
Designs and Configurations
A new class of designs which protect against quantum jumps, Des.
متن کاملForbidden configurations and Steiner designs
Let F be a (0, 1) matrix. A (0, 1) matrix M is said to have F as a configuration if there is a submatrix of M which is a row and column permutation of F . We say that a matrix M is simple if it has no repeated columns. For a given v ∈ N, we shall denote by forb(v,F) the maximum number of columns in a simple (0, 1) matrix with v rows for which F does not occur as a configuration. We say that a m...
متن کاملCounting Configurations in Designs
Given a t-(v, k, λ) design, form all of the subsets of the set of blocks. Partition this collection of configurations according to isomorphism and consider the cardinalities of the resulting isomorphism classes. Generalizing previous results for regular graphs and Steiner triple systems, we give linear equations relating these cardinalities. For any fixed choice of t and k, the coefficients in ...
متن کاملAffine Configurations of 4 Lines in R R R 3
We prove that affine configurations of 4 lines in R3 are topologically and combinatorially homeomorphic to affine configurations of 6 points in R4.
متن کامل(k, r)-ADMISSIBLE CONFIGURATIONS AND INTERTWINING OPERATORS
Certain combinatorial bases of Feigin-Stoyanovsky’s type subspaces of level k standard modules for affine Lie algebra sl(r, C)̃ are parametrized by (k, r)-admissible configurations. In this note we use Capparelli-LepowskyMilas’ method to give a new proof of linear independence of these bases, the main ingredient in the proof being the use of Dong-Lepowsky’s intertwining operators for fundamental...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1994
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00507-n